ST-PBFT: An Optimized PBFT Consensus Algorithm for Intellectual Property Transaction Scenarios

For the current Intellectual Property (IP) transaction scenario, consensus nodes need to simultaneously transactions of same type, resulting in low efficiency, accuracy, and reliability, which seriously hinders development intellectual property. Based on consortium chain, this paper proposes a secure efficient blockchain-distributed algorithm, ST-PBFT (Shard Transaction Practical Byzantine Fault Tolerance), applied IP scenario. The main contributions include following: first, grouping method based principle consistent hashing is proposed group nodes, consensus, reduces complexity communication. Second, can process parallel, improves throughput algorithm. Third, node reputation evaluation model proposed, prevent byzantine from being repeatedly elected as primary nodes. experimental results show that significantly improve efficiency reliability reduce latency.